Deterministic end-to-end delay guarantees with rate controlled EDF scheduling

نویسندگان

  • Vijay Sivaraman
  • Fabio M. Chiussi
  • Mario Gerla
چکیده

Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses the issue of identifying RC-EDF shaping parameters that realize maximal network utilizations. We first prove that finding “optimal” shapers is in general infeasible, and then propose a heuristic choice derived from the flow’s hoplength. Our choice varies gracefully between known optimal settings for the limiting values of the hop-length, and outperforms shaper selections proposed previously in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traffic Shaping for End-to-End Delay Guarantees with EDF Scheduling

Abstract— The provision of Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, Earliest Deadline First (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as Rate-Controlled EDF or RC...

متن کامل

Performance Evaluation of Resource Reservation Policies for Rate-Controlled Earliest-Deadline-First Scheduling in Multi-Service Packet Networks

The paper addresses the issue of reserving resources at packet switches along the path of flows requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing packets using the RateControlled Earliest-Deadline-First (RC-EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline for deterministic delay services in the single scheduler case...

متن کامل

End-to-End Statistical Delay Service under GPS and EDF Scheduling: A Comparison Study

Generalized Processor Sharing (GPS) has gained much popularity in recent years as a simple and effective scheduling mechanism for the provisioning of Quality of Service (QoS) in emerging high-speed networks. For supporting deterministic end-to-end delay guarantees, GPS is known to be sub-optimal in comparison to the Earliest Deadline First (EDF) scheduling discipline; nevertheless it is often p...

متن کامل

Performance Evaluation of Resource Reservation Policies for Rate-Controlled Eealiest-Deadline-First Scheduling in ATM Networks*

The paper addresses the issue of reserving resources at ATM switches along the path of calls requiring a deterministic bound on end-to-end delay. The switches are assumed to schedule outgoing cells using the Rate Controlled EarliestDeadline-First (EDF) scheduling discipline. EDF is known to be an optimal scheduling discipline when providing delay bounds to a number of calls being served by a si...

متن کامل

End-to-End Statistical Delay Guarantees using Earliest Deadline First (EDF) Packet Scheduling

This paper develops a framework for statistically guaranteeing end-to-end delay bounds to envelopeconstrained connections transporting real-time traffic in a network of switches employing the Earliest Deadline First (EDF) packet scheduling scheme in conjunction with per-hop traffic shaping. The performance of an isolated EDF scheduler fed by markovian sources has been studied earlier in the lit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Perform. Eval.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2006